Probabilistic Cellular Automata for Granular Media in Video Games
نویسندگان
چکیده
Granular materials are very common in the everyday world. Media such as sand, soil, gravel, food stuffs, pharmaceuticals, etc. all have similar irregular flow since they composed of numerous small solid particles. In video games, simulating these increases immersion and can be used for various game mechanics. Computationally, full scale simulation is not typically feasible except on most powerful hardware tends to reduced priority favor other, more integral, gameplay features. Here we study computational qualitative aspects side profile sand-like particles using cellular automata (CA). Our CA uses a standard square lattice that updates via custom, modified Margolus neighborhood. Each update occurs set probabilistic transitions tuned simulate friction between We focus look sandpile structure created from an hourglass shape over time different transition probabilities impact simulation. The toppling behavior final sandpiles largely dependent chosen probabilities. As probability topple decreases, representing greater friction, elongated begin form, leading longer settling times.
منابع مشابه
Percolation Games, Probabilistic Cellular Automata, and the Hard-core Model
Let each site of the square lattice Z be independently declared closed with probability p, and otherwise open. Consider the following game: a token starts at the origin, and the two players take turns to move it from its current site x to an open site in {x + (0, 1), x + (1, 0)}; if both these sites are closed, then the player to move loses the game. Is there positive probability that the game ...
متن کاملAround probabilistic cellular automata
We survey probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint. Some of the questions studied are specific to a domain, and some others are shared, most notably the ergodicity problem.
متن کاملProbabilistic Cellular Automata
Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involve...
متن کاملLarge Deviations for Probabilistic Cellular Automata
We consider a generalized model of a probabilistic cellular automata described by a Markov chain on an infinite dimensional space and derive certain large deviations bounds for corresponding occupational measures.
متن کاملDualities for Multi-State Probabilistic Cellular Automata
In this paper a new form of duality for probabilistic cellular automata (PCA) is introduced. Using this duality, an ergodicity result for processes having a dual is proved. Also, conditions on the probabilities defining the evolution of the processes for the existence of a dual are provided. The results are applied to wide classes of PCA which include multi-opinion voter models, competition mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The computer games journal
سال: 2021
ISSN: ['2052-773X']
DOI: https://doi.org/10.1007/s40869-020-00122-4